RFID Based Non-preemptive Random Sleep Scheduling in WSN
نویسندگان
چکیده
منابع مشابه
Threshold based Routing Protocol for WSN with Sleep/Awake Scheduling
Hierarchical routing architecture partitions the whole network in to a group of cluster and only cluster head is responsible for forwarding the data to base station. In this work, we have considered the concept of heterogeneity as in Stable Election Protocol (SEP). In heterogeneous environment, a percentage of the population of sensor nodes is equipped with additional energy resources—this is a...
متن کاملAn Adjustable Sleep Scheduling Framework for WSN
This paper presents an adjustable sleep scheduling framework for a variety of application in wireless sensor networks (WSNs) so that the lifetime of the network could be prolonged. Varies of typical applications in WSNs are analyzed to identify the same characteristics with which unified interfaces can be designed for all applications, and to identify different characteristics for which interfa...
متن کاملFrom Preemptive to Non-preemptive Speed-Scaling Scheduling
We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed s then the energy consumption is s units of energy per time unit, where α > 1 is a small constant. Our goal is to find a schedule respecting th...
متن کاملFrom non-preemptive to preemptive scheduling using synchronization synthesis
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of ca...
متن کاملFrom Preemptive to Non-preemptive Scheduling Using Rejections
We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs submitted to actual high performance platf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, Materials & Continua
سال: 2020
ISSN: 1546-2226
DOI: 10.32604/cmc.2020.06050